Powers of 2

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Powers of 2

In 2013 the function field sieve algorithm for computing discrete logarithms in finite fields of small characteristic underwent a series of dramatic improvements, culminating in the first heuristic quasi-polynomial time algorithm, due to Barbulescu, Gaudry, Joux and Thomé. In this article we present an alternative descent method which is built entirely from the on-the-fly degree two elimination...

متن کامل

The Cost of 2-Distinguishing Cartesian Powers

A graph G is said to be 2-distinguishable if there is a labeling of the vertices with two labels so that only the trivial automorphism preserves the label classes. The minimum size of a label class in any such labeling of G is called the cost of 2-distinguishing G and is denoted by ρ(G). The determining number of a graph G, denoted Det(G), is the minimum size of a set of vertices whose pointwis...

متن کامل

Expansions of Powers of 2 Jeffrey

P. Erdős asked how frequently 2 has a ternary expansion that omits the digit 2. He conjectured this holds only for finitely many values of n. We generalize this question to consider iterates of two discrete dynamical systems. The first considers ternary expansions of real sequences xn(λ) = ⌊λ2 ⌋, where λ > 0 is a real number, and the second considers 3-adic expansions of sequences yn(λ) = λ2 , ...

متن کامل

Spin representations , powers of 2 and the

Generalizing results on spin character degrees, we determine for a given conjugacy class of odd type in the double cover of S n spin characters of S n which have the minimal 2-power on this class in their character value. Surprisingly, the Glaisher map plays an important r^ ole here.

متن کامل

Domination number of graph fractional powers

For any $k in mathbb{N}$, the $k$-subdivision of graph $G$ is a simple graph $G^{frac{1}{k}}$, which is constructed by replacing each edge of $G$ with a path of length $k$. In [Moharram N. Iradmusa, On colorings of graph fractional powers, Discrete Math., (310) 2010, No. 10-11, 1551-1556] the $m$th power of the $n$-subdivision of $G$ has been introduced as a fractional power of $G$, denoted by ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Notre Dame Journal of Formal Logic

سال: 1999

ISSN: 0029-4527

DOI: 10.1305/ndjfl/1022615615